Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes

نویسندگان

  • Jianying Fang
  • Yanxun Chang
چکیده

It is known that extremal doubly-even self-dual codes of length n ≡ 8 or 0 (mod 24) yield 3or 5-designs respectively. In this paper, by using the generator matrices of bordered double circulant doubly-even self-dual codes, we give 3-(n, k; m)-SEEDs with (n, k, m) ∈ {(32, 8, 5), (56, 12, 9), (56, 16, 9), (56, 24, 9), (80, 16, 52)}. With the aid of computer, we obtain 22 generator matrices of bordered double circulant doubly-even selfdual codes of length 48, which enable us to get 506 mutually disjoint 5-(48, k, λ) designs for (k, λ)=(12, 8),(16, 1356),(20, 36176). Moreover, this implies 5-(48, k; 506)-SEEDs for k = 12, 16, 20, 24.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of new extremal self-dual codes

In this paper, new binary extremal self-dual codes are presented. A number of new extremal singly-even self-dual codes of lengths 48; 64 and 78, and extremal doubly-even self-dual codes of lengths 80 and 88, are constructed. We also relate an extremal doubly-even self-dual code of length divisible by 24 to an extremal singly-even self-dual code of that length. New singly-even self-dual codes of...

متن کامل

On doubly circulant doubly even self-dual [72, 36, 12] codes

We give a classification of all double circulant doubly even self-dual [72, 36, 12] codes. We also demonstrate that every double circulant doubly even self-dual [72, 36, 12] code has no extremal doubly even self-dual [72, 36, 16] neighbor.

متن کامل

On a 5-design related to a putative extremal doubly even self-dual code of length a multiple of 24

By the Assmus and Mattson theorem, the codewords of each nontrivial weight in an extremal doubly even self-dual code of length 24m form a self-orthogonal 5-design. In this paper, we study the codes constructed from self-orthogonal 5-designs with the same parameters as the above 5-designs. We give some parameters of a self-orthogonal 5-design whose existence is equivalent to that of an extremal ...

متن کامل

Extension theorems for self-dual codes over rings and new binary self-dual codes

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F2m + uF2m for m = 1, 2. The duality and distance preserving Gray maps from F4 + uF4 to (F2 + uF2) and F42 are used to obtain self-dual codes whose binary Gray images are [64, 32, 12]-extremal self-dual. An F2 + uF2-exten...

متن کامل

On the covering radii of extremal doubly even self-dual codes

In this note, we study the covering radii of extremal doubly even self-dual codes. We give slightly improved lower bounds on the covering radii of extremal doubly even self-dual codes of lengths 64, 80 and 96. The covering radii of some known extremal doubly even self-dual [64, 32, 12] codes are determined.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2014